Proving a Group Trivial Made Easy: a Case Study in Coset Enumeration
نویسنده
چکیده
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for investigating nitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such family of presentations proposed by B.H. Neumann. We show that the problems are much easier than they rst appear, albeit at the expense of considerable preliminaryèxperimentation'. This demonstrates how far the range of applicability of coset enumeration has improved.
منابع مشابه
The trivial group made
Coset enumeration, based on the methods described by Todd & Coxeter, is one of the basic tools for investigating nitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such presentation. We show that it is much easier than it rst appears, albeit at the ...
متن کاملMSc project: Coset enumeration and its applications
This project is appropriate for someone with an interest in both group theory and algorithms. Familiarity with basic group theory is essential. A group may be described very compactly via a presentation by generators and relations. For example, the alternating group A5 of order 60 is isomorphic to 〈x, y | x = y = (xy) = 1〉. However, it is not usually easy to study a group given by a presentatio...
متن کاملOn doing Todd-Coxeter enumeration in parallel*
Akl, S., G. Laborite, M. Leeder and K. Qiu, On doing Todd-Coxeter coset enumeration in parallel, Discrete Applied Mathematics 34 (1991) 27-35. The Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in computational group theory. Surprisingly, however, it seems that no attempt has yet been made at producing a parallel version of it. This paper reports ...
متن کاملSome Challenging Group Presentations
We study some challenging presentations which arise as groups of deeciency zero. In four cases we settle niteness: we show that two presentations are for nite groups while two are for innnite groups. Thus we answer three explicit questions in the literature and we provide the rst published deeciency zero presentation for a group with soluble length seven. The tools we use are coset enumeration ...
متن کاملAndrews-Curtis and Todd-Coxeter proof words
Andrews and Curtis have conjectured that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. It can be difficult to determine whether or not the conjecture holds for a particular presentation. We show that the utility PEACE, which produces proofs based on Todd-Coxeter coset enumeration, can produce ...
متن کامل